A Short History of Packing Problems

نویسنده

  • D. WEAIRE
چکیده

Packing problems have arisen throughout the history of science. In particular the problem of the densest close packing of spheres has become celebrated as the Kepler Problem. The history of the subject is briefly reviewed, from both mathematical and physical (or practical) standpoints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بررسـی استانداردهای کیف های کودکان دبستانی شهر خرم آباد سا ل تحصیلی 87- 1386

Background: A large number of students tend to carry school backpacks. Carring heavy backpacks is increasingly putting the students at risk, and may cause long term damage to their growing body. This survey was conducted on Khorramabad primary school students to determine if their backpacks are too heavy and the methods of packing and wearing them, and history of back pain among them. Mater...

متن کامل

 Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...

متن کامل

بررسی تعدادی از روشهای آماری جهت ترسیم نمودار کنترل مشاهدات انفرادی برای فرایندهای اتورگرسیو

  Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fu...

متن کامل

روشی جدید برای چیدمان قطعات مستطیل شکل در یک فضای مستطیل شکل

 Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The objective fun...

متن کامل

A Greedy Adaptive Search Procedure for Multi-Dimensional Multi-Container Packing Problems

Multi-dimensional multi-container packing problems appear within many settings of theoretical and practical interest, including Knapsack, Strip Packing, Container Loading, and Scheduling problems. These various problem settings display different objective functions and constraints, which may explain the lack of efficient heuristics able to jointly address them. In this paper we introduce GASP G...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001